منابع مشابه
Irreducible and Periodic Positive Maps
We extend the notions of irreducibility and periodicity of a stochastic matrix to a unital positive linear map © on a finite-dimensional C∗algebra A and discuss the non-commutative version of the Perron-Frobenius theorem. For a completely positive linear map © with ©(a) = ∑ l Ll ∗aLl, we give conditions on the Ll’s equivalent to irreducibility or periodicity of ©. As an example, positive linear...
متن کاملIrreducible Positive Linear Maps on Operator Algebras
Motivated by the classical results of G. Frobenius and O. Perron on the spectral theory of square matrices with nonnegative real entries, D. Evans and R. Høegh-Krohn have studied the spectra of positive linear maps on general (noncommutative) matrix algebras. The notion of irreducibility for positive maps is required for the Frobenius theory of positive maps. In the present article, irreducible...
متن کاملA Note on Irreducible Maps with Several Boundaries
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary (non necessarily irreducible) bipartite planar maps, which is recovered by taking d = 0. As an application, we obtain an expression for the number of d-irreduc...
متن کاملIrreducible Complexity of Iterated Symmetric Bimodal Maps
The concept of irreducible complexity of a biological system was introduced by Behe [1] in 1996. His point of view is that an organism consisting of a finite, possibly very large, number of independent components, coupled together in some way, exhibits irreducible complexity if, by removing any of its components, the reduced system no longer functions meaningfully. Using the language of nonline...
متن کاملIrreducible k-to-1 Maps Onto Grids
In this paper we explore the existence of exactly k-to-1 continuous functions between graphs, and more specifically 2-to-1 continuous function between graphs that are irreducibly 2-to-1, meaning that no restriction of the function to a subgraph is 2-to-l. We show how to construct such functions in some general cases, and then more specifically onto rectangular grids. We have in mind an applicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2014
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548314000340